翻訳と辞書 |
Shannon switching game : ウィキペディア英語版 | Shannon switching game The Shannon switching game is an abstract strategy game for two players, invented by Claude Shannon. It is commonly played on a rectangular grid; this special case of the game was independently invented by David Gale and is also known as Gale or Bridg-It.〔〔.〕 == Rules ==
The game is played on a finite graph with two special nodes, ''A'' and ''B''. Each edge of the graph can be either colored or removed. The two players are called ''Short'' and ''Cut'', and alternate moves. On ''Cut'' 's turn, he deletes from the graph a non-colored edge of his choice. On ''Short'' 's turn, he colors any edge still in the graph. If ''Cut'' manages to turn the graph into one where ''A'' and ''B'' are no longer connected, he wins. If ''Short'' manages to create a colored path from ''A'' to ''B'', he wins. There are also versions of the Shannon switching game played on a directed graph and an oriented matroid. A solution has been explicitly found for any such game using matroid theory,〔.〕 unlike a similar game Hex, which is PSPACE hard.〔.〕
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Shannon switching game」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|